Randomized Triangle Algorithms for Convex Hull Membership
نویسنده
چکیده
The triangle algorithm introduced in [6], tests if a given p ∈ R lies in the convex hull of a set S of n points in R. It computes p′ ∈ conv(S) such that either d(p′, p) is within prescribed tolerance, or p′ certifies p ̸∈ conv(S). In order to improve its performance, we propose two randomized versions. Bounds on their expected complexity is identical with deterministic bounds. One is inspired by the chaos game and a property of resulting Sierpinski triangle.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملHigher Dimensional Convex Hull Algorithms 1 Convex hulls
• Sd: A d-Simplex The simplest convex polytope in R. A d-simplex is always the convex hull of some d + 1 affinely independent points. For example, a line segment is a 1− simplex i.e., the smallest convex subspace which contains two points. A triangle is a 2 − simplex and a tetrahedron is a 3− simplex. • P: A Simplicial Polytope. A polytope where each facet is a d− 1 simplex. By our assumption, ...
متن کاملSolving Linear System of Equations Via A Convex Hull Algorithm
We present new iterative algorithms for solving a square linear system Ax = b in dimension n by employing the Triangle Algorithm [17], a fully polynomial-time approximation scheme for testing if the convex hull of a finite set of points in a Euclidean space contains a given point. By converting Ax = b into a convex hull problem and solving via the Triangle Algorithm, together with a sensitivity...
متن کاملHyperplane Separability and Convexity of Probabilistic Point Sets
We describe an O(n) time algorithm for computing the exact probability that two d-dimensional probabilistic point sets are linearly separable, for any fixed d ≥ 2. A probabilistic point in d-space is the usual point, but with an associated (independent) probability of existence. We also show that the d-dimensional separability problem is equivalent to a (d + 1)-dimensional convex hull membershi...
متن کاملComplexity aspects of the triangle path convexity
A path P = v1, . . . , vt is a triangle path (respectively, monophonic path) of G if no edges exist joining vertices vi and vj of P such that |j − i| > 2; (respectively, |j − i| > 1). A set of vertices S is convex in the triangle path convexity (respectively, monophonic convexity) of G if the vertices of every triangle path (respectively, monophonic path) joining two vertices of S are in S. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1410.3564 شماره
صفحات -
تاریخ انتشار 2014